Reducing rank of the adjacency matrix by graph modification
نویسندگان
چکیده
منابع مشابه
Reducing the Adjacency Matrix of a Tree
Let T be a tree, A its adjacency matrix, and a scalar. We describe a linear-time algorithm for reducing the matrix In +A. Applications include computing the rank of A, nding a maximum matching in T , computing the rank and determinant of the associated neighborhood matrix, and computing the characteristic polynomial of A.
متن کاملThe Adjacency Matrix and Graph Coloring
These notes are not necessarily an accurate representation of what happened in class. The notes written before class say what I think I should say. I sometimes edit the notes after class to make them way what I wish I had said. There may be small mistakes, so I recommend that you check any mathematically precise statement before using it in your own work. These notes were last revised on Septem...
متن کاملGraph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probability matrix of a Markov chain. The nodeorder of the steady state random walk associated with this Markov chain is determined by the co-efficent order of the leading eigenvector of the adjacency matrix. We match nodes in ...
متن کاملOn the adjacency matrix of a threshold graph
A threshold graph on n vertices is coded by a binary string of length n − 1. We obtain a formula for the inertia of (the adjacency matrix of) a threshold graph in terms of the code of the graph. It is shown that the number of negative eigenvalues of the adjacency matrix of a threshold graph is the number of ones in the code, whereas the nullity is given by the number of zeros in the code that a...
متن کاملAdjacency metric dimension of the 2-absorbing ideals graph
Let Γ=(V,E) be a graph and W_(a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),… ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.02.020